منابع مشابه
Job-shop scheduling in a body shop
We study a generalized job-shop problem called the body shop scheduling problem (BSSP). This problem arises from the industrial application of welding in a car body production line, where possible collisions between industrial robots have to be taken into account. BSSP corresponds to a job-shop problem where the operations of a job have to follow alternating routes on the machines, certain oper...
متن کاملShop Cells
In this paper the Group Technology problem of grouping parts in families and machines in cells in order to convert a job shop production system to some pseudo ow shops is considered. Several heuristic methods for solving Group Technology problem have been proposed in the literature, in general, not producing a ow shop in each cell|unless a great number of extra machines is added. We use known t...
متن کاملMathematical Models of Flow Shop and Job Shop Scheduling Problems
In this paper, mathematical models for permutation flow shop scheduling and job shop scheduling problems are proposed. The first problem is based on a mixed integer programming model. As the problem is NP-complete, this model can only be used for smaller instances where an optimal solution can be computed. For large instances, another model is proposed which is suitable for solving the problem ...
متن کاملBanking: shop and compare.
There are many reasons to take a critical look at the practice's banking relationship(s)--technology advancements, security measures, improvements in available services, recent banking enhancements designed specifically for medical practices, the impact of the financial crisis on bank ratings and stability, changing practice needs, opportunities for operational automation at the practice--and i...
متن کاملShort Shop Schedules
We consider the open shop, job shop, and ow shop scheduling problems with integral processing times. We give polynomial-time algorithms to determine if an instance has a schedule of length at most 3, and show that deciding if there is a schedule of length at most 4 is N P-complete. The latter result implies that, unless P = N P, there does not exist a polynomial-time approximation algorithm for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Biotechnology
سال: 2008
ISSN: 1087-0156,1546-1696
DOI: 10.1038/nbt1008-1058b